Enumerating big orbits and an application: B acting on the cosets of Fi23
نویسندگان
چکیده
We describe a novel technique to handle big permutation domains for large groups. It is applied to the multiplicity-free action of the sporadic simple Baby Monster group on the cosets of its maximal subgroup Fi23, to determine the character table of the associated endomorphism ring.
منابع مشابه
On cohomogeneity one nonsimply connected 7-manifolds of constant positive curvature
In this paper, we give a classification of non simply connected seven dimensional Reimannian manifolds of constant positive curvature which admit irreducible cohomogeneity-one actions. We characterize the acting groups and describe the orbits. The first and second homo-topy groups of the orbits have been presented as well.
متن کاملIMPROVED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL DIMENSIONAL DESIGN OF STRUCTURAL WALLS SYSTEM
Among the different lateral force resisting systems, shear walls are of appropriate stiffness and hence are extensively employed in the design of high-rise structures. The architectural concerns regarding the safety of these structures have further widened the application of coupled shear walls. The present study investigated the optimal dimensional design of coupled shear walls based on the im...
متن کاملOrbit Invariants and an Application to the Baby Monster
We prove that the minimal base size for the permutation action of the sporadic simple Baby monster group B on the cosets of its 7th and 8th maximal subgroup is 3 and 2 respectively. Motivated by the large sizes of these permutation actions, we develop new computational methods to prove that an orbit is regular and to show that two orbits are disjoint.
متن کاملEnumerating Large Orbits and Direct Condensation
We describe a new implementation of direct condensation, which is a tool in computational representation theory. The crucial point for this is the enumeration of very large orbits for a group acting on some set. We present a variation of the standard orbit enumeration algorithm that reduces the amount of storage needed and behaves well under parallelization. For the special case of matrices act...
متن کاملRank 3 Permutation Characters and Maximal Subgroups
Let G be a transitive permutation group acting on a finite set E and let P be the stabilizer in G of a point in E. We say that G is primitive rank 3 on E if P is maximal in G and P has exactly three orbits on E. For any subgroup H of G, we denote by 1H the permutation character (or permutation module) over C of G on the cosets G/H. Let H and K be subgroups of G. We say 1H 6 1 G K if 1 G K − 1 G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006